Multiple Kernel Fuzzy Clustering With Unsupervised Random Forests Kernel and Matrix-Induced Regularization
نویسندگان
چکیده
منابع مشابه
Kernel Induced Random Survival Forests
Kernel Induced Random Survival Forests (KIRSF) is a statistical learning algorithm which aims to improve prediction accuracy for survival data. As in Random Survival Forests (RSF), Cumulative Hazard Function is predicted for each individual in the test set. Prediction error is estimated using Harrell’s concordance index (C index) [Harrell et al. (1982)]. The C-index can be interpreted as a misc...
متن کاملAn Overview of Unsupervised and Semi-Supervised Fuzzy Kernel Clustering
For real-world clustering tasks, the input data is typically not easily separable due to the highly complex data structure or when clusters vary in size, density and shape. Kernel-based clustering has proven to be an effective approach to partition such data. In this paper, we provide an overview of several fuzzy kernel clustering algorithms. We focus on methods that optimize an fuzzy C-mean-ty...
متن کاملUnsupervised Multiple Kernel Learning
Traditional multiple kernel learning (MKL) algorithms are essentially supervised learning in the sense that the kernel learning task requires the class labels of training data. However, class labels may not always be available prior to the kernel learning task in some real world scenarios, e.g., an early preprocessing step of a classification task or an unsupervised learning task such as dimens...
متن کاملFunctional Data Classification with Kernel-Induced Random Forests
Scientists and others today often collect samples of curves and other functional data. The multivariate data classification methods cannot be directly used for functional data classification because the curse of dimensionality and difficulty in taking in account the correlation and order of functional data. We extend the kernel-induced random forest method for discriminating functional data by ...
متن کاملGreedy Unsupervised Multiple Kernel Learning
Multiple kernel learning (MKL) has emerged as a powerful tool for considering multiple kernels when the appropriate representation of the data is unknown. Some of these kernels may be complementary, while others irrelevant to the learning task. In this work we present an MKL method for clustering. The intra-cluster variance objective is extended by learning a linear combination of kernels, toge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2018.2889185